Linear program fixed-point representation

A Fixed Point Representation of References

This position paper is concerned with the reference in computer science. We have a formal representation of lazy references in contrast to eager and failure ones. The representation problem is motivated by static analysis in Web accessibility. A fixed point theory is adopted for such an analysis.

Program Derivation by Fixed Point Computation

Thrs paper develops a transformational paradrgm by which nonnumertcal algorrthms are treated as fixed pomt computatrons derived from very htgh level problem specrficatrons We begin by presenting an abstract functronal problem specrficatron language SQ’, which 1s shown to express any partial recursive function m a fixed pomt normal form Next, we gtce a nondetermuusttc Iterative schema that rn th...

Fixed point theorems for middle point linear operators in L

In this paper we introduce the notion of middle point linear operators. We prove a fixed point result for middle point linear operators in L. We then present some examples and, as an application, we derive a Markov-Kakutani type fixed point result for commuting family of α-nonexpansive and middle point linear operators in L.

Fixed Point Theorems for Middle Point Linear Operators in L1

Orthogonal Wavelet Coefficient Precision and Fixed Point Representation

The Discrete Wavelet Transform (DWT) is an important transform with many signal processing applications, most notably, compression. Many architectures have been proposed to perform DWT, but few address the precision of the coefficients necessary to ensure perfect reconstruction. The goal of this work is to experimentally determine the precision of the filter coefficients (for an orthogonal wave...